<html><head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head><body>
<span style="position:absolute; border: gray 1px solid; left:0px; top:50px; width:595px; height:841px;"></span>
<div style="position:absolute; top:50px;"><a name="1">Page 1</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:209px; top:134px; width:176px; height:21px;"><span style="font-family: LNUHNF+SimSun; font-size:15px">第八届</span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">“</span><span style="font-family: LNUHNF+SimSun; font-size:15px">认证杯</span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">”</span><span style="font-family: LNUHNF+SimSun; font-size:15px">数学中国
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:242px; top:168px; width:112px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:15px">数学建模国际赛
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:258px; top:199px; width:80px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:15px">承 诺 书
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:258px; width:370px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">我们仔细阅读了第八届</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">“</span><span style="font-family: LNUHNF+SimSun; font-size:12px">认证杯</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">”</span><span style="font-family: LNUHNF+SimSun; font-size:12px">数学中国数学建模国际赛的竞赛规则。
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:283px; width:394px; height:12px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">我们完全明白，在竞赛开始后参赛队员不能以任何方式（包括电话、电子邮
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:307px; width:415px; height:12px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">件、网上咨询等）与队外的任何人（包括指导教师）研究、讨论与赛题有关的问
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:330px; width:24px; height:12px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">题。
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:352px; width:394px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">我们知道，抄袭别人的成果是违反竞赛规则的</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">, </span><span style="font-family: LNUHNF+SimSun; font-size:12px">如果引用别人的成果或其他
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:377px; width:415px; height:12px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">公开的资料（包括网上查到的资料），必须按照规定的参考文献的表述方式在正
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:400px; width:180px; height:12px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">文引用处和参考文献中明确列出。
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:424px; width:394px; height:12px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">我们郑重承诺，严格遵守竞赛规则，以保证竞赛的公正、公平性。如有违反
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:447px; width:216px; height:12px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">竞赛规则的行为，我们将受到严肃处理。
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:469px; width:396px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">我们允许数学中国网站</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(www.madio.net)</span><span style="font-family: LNUHNF+SimSun; font-size:12px">公布论文，以供网友之间学习交流，
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:494px; width:360px; height:12px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">数学中国网站以非商业目的的论文交流不需要提前取得我们的同意。
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:515px; width:132px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">我们的参赛队号为：</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:110px; top:542px; width:140px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">我们选择的题目是： </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">D </span><span style="font-family: WRGGGP+DengXian-Regular; font-size:14px">题
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:570px; width:109px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">参赛队员 </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(</span><span style="font-family: LNUHNF+SimSun; font-size:12px">签名</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">) </span><span style="font-family: LNUHNF+SimSun; font-size:12px">：
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:171px; top:593px; width:81px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">队员 </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">1</span><span style="font-family: LNUHNF+SimSun; font-size:12px">：卓泽滨
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:192px; top:617px; width:81px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">队员 </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">2</span><span style="font-family: LNUHNF+SimSun; font-size:12px">：徐小圣
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:171px; top:640px; width:81px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">队员 </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">3</span><span style="font-family: LNUHNF+SimSun; font-size:12px">：周欣缘
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:710px; width:139px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:12px">参赛队教练员 </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(</span><span style="font-family: LNUHNF+SimSun; font-size:12px">签名</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">)</span><span style="font-family: LNUHNF+SimSun; font-size:12px">： 无
<br></span></div><span style="position:absolute; border: black 1px solid; left:235px; top:482px; width:75px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:313px; top:525px; width:186px; height:228px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:941px; width:595px; height:841px;"></span>
<div style="position:absolute; top:941px;"><a name="2">Page 2</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:983px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:983px; width:52px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 2 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:209px; top:1078px; width:176px; height:21px;"><span style="font-family: LNUHNF+SimSun; font-size:15px">第八届</span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">“</span><span style="font-family: LNUHNF+SimSun; font-size:15px">认证杯</span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">”</span><span style="font-family: LNUHNF+SimSun; font-size:15px">数学中国
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:242px; top:1125px; width:112px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:15px">数学建模国际赛
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:242px; top:1157px; width:112px; height:15px;"><span style="font-family: LNUHNF+SimSun; font-size:15px">编 号 专 用 页
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:132px; top:1247px; width:336px; height:14px;"><span style="font-family: LNUHNF+SimSun; font-size:14px">参赛队伍的参赛队号：（请各个参赛队提前填写好）：
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:132px; top:1295px; width:28px; height:14px;"><span style="font-family: LNUHNF+SimSun; font-size:14px">1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:132px; top:1375px; width:322px; height:14px;"><span style="font-family: LNUHNF+SimSun; font-size:14px">竞赛统一编号（由竞赛组委会送至评委团前编号）：
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:132px; top:1631px; width:308px; height:14px;"><span style="font-family: LNUHNF+SimSun; font-size:14px">竞赛评阅编号（由竞赛评委团评阅前进行编号）：
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:997px; width:415px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:99px; top:1550px; width:435px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:1833px; width:595px; height:841px;"></span>
<div style="position:absolute; top:1833px;"><a name="3">Page 3</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:1875px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:1875px; width:52px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 3 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:107px; top:1991px; width:382px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">Bitpoll: an electronic voting system based on blockchain
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:2025px; width:416px; height:109px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">Abstract: </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">With blockchain technology advancing, it has been applied in various
<br>fields. In election for example, blockchain can tackle the root problem of traditional
<br>e-voting system insecurity caused by third-party authority. This paper provides a brief
<br>review on blockchain and raises an underlying design of blockchain electronic voting
<br>system (BEV). Then potential problems of existing BEV systems are evaluated and
<br>corresponding solutions are provided. Finally, some extra ideas are proposed in order
<br>to reduce the complexity of the system and improve its security.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:2149px; width:185px; height:31px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">Key words: Blockchain; Bitpoll;
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">Public-key cryptography; Security
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:285px; top:2149px; width:221px; height:15px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">Incentive; Consensus Algorithm; PoW;
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:1889px; width:415px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:2725px; width:595px; height:841px;"></span>
<div style="position:absolute; top:2725px;"><a name="4">Page 4</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:2767px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:2767px; width:52px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 4 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:264px; top:2812px; width:67px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">Summary
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:2839px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The passage mainly discusses on an underlying design of a BEV system, the
<br>possible problem of existing BEV model and solution accordingly as well as the
<br>optimization and improvement of the complexity and security of the BEV system.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:2885px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">First of all, the article carries out a review on blockchain. Imitating the Bitcoin
<br>blockchain techniques, an underlying design of BEV is raised, which turn Bitcoin to
<br>Bitpoll. With modification of some protocols and rules, a decentralized voting system
<br>is born.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:2948px; width:416px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Furthermore, the present paper analyzes the potential problems of the existing
<br>BEV system on their
<br>incentive mechanism, consensus algorithm and security
<br>respectively as well as some innovative solution and novel techniques. From different
<br>aspects of the blockchain layers, the article points out several vulnerabilities which
<br>might cause extinct danger.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:3026px; width:416px; height:109px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Besides, Optimization on the algorithm and approaches to improve the security
<br>of the BEV systems are introduced. Some State-of-the-art methods like Mimic
<br>blockchain, PoRA and FORK-256 hash function are also proposed, which are likely to
<br>reduce the complexity of the whole network and strengthen the robustness of the
<br>systems. Eventually, the passage introduces another model on the basis of smart
<br>contract and Ethereum and some future work, existing in other BEV, is illustrated as
<br>well.
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:2781px; width:415px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:3617px; width:595px; height:841px;"></span>
<div style="position:absolute; top:3617px;"><a name="5">Page 5</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:3659px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:3659px; width:52px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 5 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:244px; top:3743px; width:106px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">Technical Note:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:3770px; width:338px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The basic techniques deployed in blockchain this paper are as follows:
<br></span><span style="font-family: CSKSUK+Wingdings-Regular; font-size:13px"> </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Peer-to-Peer Network Technology(P2P)
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:135px; top:3801px; width:371px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">P2P network is the underlying layer of the blockchain, as its physical basis,
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:3816px; width:323px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">this paper intends to adopt DHT network for shorter network delay.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:3832px; width:205px; height:15px;"><span style="font-family: CSKSUK+Wingdings-Regular; font-size:13px"> </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Asymmetric Cryptographic Technique
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:3848px; width:395px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">As a backbone to the blockchain, most of the procedure will employ it for
<br>privacy sakes. This passage employs Elliptic Curve Cryptography to generate
<br>public key from private, RIPEMD160 to gain public key hash, Base58 Algorithm
<br>to deduce the wallet/ballots box address. And finally, SHA256 for calculation of
<br>merkle roots and block hash.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:3926px; width:240px; height:15px;"><span style="font-family: CSKSUK+Wingdings-Regular; font-size:13px"> </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Consensus Algorithm—Proof of Work (PoW)
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:3941px; width:395px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Consensus Algorithm is to maintain the consistency of the blockchain
<br>copies on all the nodes. The article mainly introduces PoW, the method of
<br>verification by workload, also the mainstream of virtual coin.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:3988px; width:93px; height:15px;"><span style="font-family: CSKSUK+Wingdings-Regular; font-size:13px"> </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Smart Contract
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:134px; top:4004px; width:372px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">An automatic-execute code on the platform called Ethereum in essence. It is
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:4019px; width:245px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">widely deployed in various fields besides currency.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:4035px; width:154px; height:15px;"><span style="font-family: CSKSUK+Wingdings-Regular; font-size:13px"> </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Mimic Defense Technology
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:135px; top:4050px; width:371px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Mimic Defense Technology is to adopt a different consensus algorithm with
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:4066px; width:369px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">more safety from cyberattacks, whose core is the following techniques DHR.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:4082px; width:239px; height:15px;"><span style="font-family: CSKSUK+Wingdings-Regular; font-size:13px"> </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Dynamic Heterogeneous Redundancy (DHR)
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:134px; top:4097px; width:344px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">A Cryptography that change the algorithm randomly with a key,
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:486px; top:4097px; width:20px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">thus
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:4113px; width:110px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">increasing the security.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:4128px; width:159px; height:15px;"><span style="font-family: CSKSUK+Wingdings-Regular; font-size:13px"> </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Proof-Of-Random-Authority
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:134px; top:4144px; width:372px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">A innovative technique as a consensus algorithm, randomly selected nodes
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:4160px; width:306px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">among the miners for verification instead of the whole network.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:4175px; width:264px; height:15px;"><span style="font-family: CSKSUK+Wingdings-Regular; font-size:13px"> </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Difficulty Modifying Strategy Using Electric Load
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:4191px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">To adjust the difficulty according to the electric load of the power grid thus
<br>saving the energy resource due to the process of mining as well as maintaining
<br>the block size effectively.
<br></span><span style="font-family: CSKSUK+Wingdings-Regular; font-size:13px"> </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">HVC Paralleled Algorithm
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:135px; top:4253px; width:371px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">A hash function as to mix various hash algorithm to prevent the blockchain
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:4269px; width:218px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">from centralizing by large-scale mining pools
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:4284px; width:74px; height:15px;"><span style="font-family: CSKSUK+Wingdings-Regular; font-size:13px"> </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">FORK 256
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:134px; top:4300px; width:372px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">A quite state-of-the-art hash has stronger security than SHA256 from
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:4316px; width:141px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">cyberattacks like &quot;Rainbows&quot;
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:3673px; width:415px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:4509px; width:595px; height:841px;"></span>
<div style="position:absolute; top:4509px;"><a name="6">Page 6</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:4551px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:4551px; width:52px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 6 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:267px; top:4596px; width:61px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">Contents
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:4651px; width:414px; height:624px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Summary........................................................................................................................ 4
<br>Technical Note:.............................................................................................................. 5
<br>Contents..........................................................................................................................6
<br>I. Introduction.................................................................................................................8
<br>II. The Description of the Problem.................................................................................8
<br>III. Brief review on blockchain...................................................................................... 9
<br>3.1 The Distributed network...................................................................................9
<br>3.2 Transaction..................................................................................................... 10
<br>3.2.1 Public Key Cryptography [9]..............................................................10
<br>3.2.2 Elliptic Curve Cryptography and Hash Algorithm..............................11
<br>3.2.3 The Data Structure of Transaction Record..........................................11
<br>3.2.4 The Verification and Broadcast of Transaction................................... 12
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">3.3 The Data Structure of the Block.....................................................................13
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Timestamp and Timestamp Server:..............................................................13
<br>Block Body:................................................................................................. 13
<br>Merkle root:..................................................................................................13
<br>Block ID:......................................................................................................14
<br>Nonce:.......................................................................................................... 14
<br>Difficulty:.....................................................................................................14
<br>3.4 Procedure of Adding A New Block................................................................14
<br>3.4.1 Miners and Incentive...........................................................................14
<br>3.4.2 Consensus Algorithm.......................................................................... 15
<br>3.5 General Model of Bitcoin...............................................................................16
<br>IV. The Underlying Design Models Based on Blockchain.......................................... 17
<br>4.1 Bitcoin to Bitpoll............................................................................................17
<br>4.1.1 Distribution of Bitpoll.........................................................................17
<br>4.1.2 Voting Operation and Bitpoll Structure...............................................18
<br>4.1.3 Protocol to Prevent Bitpoll Reuse.......................................................19
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">4.2 Miners and incentive......................................................................................20
<br>4.3 Registration.................................................................................................... 20
<br>4.4 Consensus Algorithm and Data Structure of Block....................................... 21
<br>4.5 Privacy Protection.......................................................................................... 22
<br>4.6 Difficulty Modifying Strategy........................................................................22
<br>4.7 Abstention...................................................................................................... 23
<br>4.8 The Entities of Bitpoll Blockchain.................................................................23
<br>Registration Server:......................................................................................23
<br>Eligible voters:............................................................................................. 24
<br>Miners:......................................................................................................... 24
<br>Tallying Authority:....................................................................................... 24
<br>4.9 Election Stage.................................................................................................24
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:4565px; width:415px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:5401px; width:595px; height:841px;"></span>
<div style="position:absolute; top:5401px;"><a name="7">Page 7</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:5443px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:5443px; width:52px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 7 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:5483px; width:414px; height:358px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Registration Phase........................................................................................24
<br>Initial Distribution Phase..............................................................................24
<br>Voting Phase.................................................................................................25
<br>Tallying.........................................................................................................25
<br>Verification...................................................................................................25
<br>V. Possible Problems of Blockchain Technology in REV and Improvements.............25
<br>5.1 Incentive.........................................................................................................26
<br>5.2 Consensus Algorithm..................................................................................... 26
<br>5.3
<br>Security[19]................................................................................................ 26
<br>VI. Optimization and Improvement on Complexity and Security............................... 27
<br>6. 1Mimic blockchain contribute to the security of blockchain...........................27
<br>6.1.1. Potential Security Issues in Blockchain Technology......................... 27
<br>6.1.2. What is Cryptographic Sortition Technology?...................................28
<br>6.1.3. What is Mimic Blockchain?...............................................................28
<br>6.2 PoRA Consensus Algorithm to Reduce the Complexity................................28
<br>6.3 FORK-256 for Better Security.......................................................................29
<br>VII. Conclusions.......................................................................................................... 29
<br>VIII. Future Work.........................................................................................................30
<br>8.1 The limitations of the current e-voting systems.............................................30
<br>8.2 The Smart contract in e-voting system...........................................................30
<br>VI. References..............................................................................................................32
<br>Appendix......................................................................................................................33
<br>7.1 The Principle of ECC[8,10]........................................................................... 33
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:5456px; width:415px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:6293px; width:595px; height:841px;"></span>
<div style="position:absolute; top:6293px;"><a name="8">Page 8</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:6335px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:6335px; width:52px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 8 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:247px; top:6419px; width:100px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">I. Introduction
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:108px; top:6445px; width:387px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">When it comes to the secure elections, mounting number of people have come to
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:6461px; width:409px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">realize the severity of such an unsettling phenomenon that there are still plenty of
<br>room for existing voting systems to improve. It is not surprising to hear remote
<br>absentee ballot tampering in a voter fraud incident these days. A latest example is the
<br>ballot tampering scandal in the 2019 North Carolina elections
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:6523px; width:408px; height:124px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">As mail-in votes tend to be nefariously used such as being impersonated, altered
<br>or threated, Information Technology has been widely applied to the voting system.
<br>However, most of the electronic voting systems design might be poor where online
<br>ballots should go through a database administrator, namely a third-party certification
<br>authority with poor behavior [1], Since e-voting systems might affect the feeling of
<br>the voter for their rights [2,3]. Therefore, it is significant to abandon the third-party
<br>authority without risk of system disabled. A novel e-voting system different from the
<br>traditional one will be proposed in the present paper.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:108px; top:6648px; width:393px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Similar to Bitcoin blockchain established by Nakamoto in 2009, the present paper
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:6664px; width:413px; height:140px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">comes up with a Bitpoll model where the Bitpoll would be tallied by the whole
<br>peer-to-peer network instead of statistics bureau. Supported by a distributed network
<br>consisting of large number of interconnected nodes, each of these nodes has their own
<br>copy of distributed ledger that contain the full history of voting record. The
<br>advantages of using a e-voting scheme on blockchain basis might include the
<br>following [4]: i) Greater transparency because of the open blockchain, ii) well
<br>protection for voters due to its inherent anonymity, iii) stronger integrity and
<br>immutability for voting record with copies of chain on each nodes and consensus
<br>algorithm.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:108px; top:6804px; width:344px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The present paper demonstrates an underlying design for e-voting using
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:6820px; width:396px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">blockchain technology and discuss the potential problems of REV systems and the
<br>corresponding solution and techniques that might benefit to the simplification and
<br>safety of the blockchain.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:180px; top:6879px; width:234px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">II. The Description of the Problem
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:6905px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">In order to design a blockchain electronic voting system (BEV), there are various
<br>factors which might affect the results of elections should be considered. Therefore, the
<br>present paper concludes following problems that a BEV should be able to solve
<br>[4,17]:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:6968px; width:395px; height:15px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">Eligibility</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">: Voters could not vote more than command. And to avoid virtual
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:6983px; width:298px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">identification abuse, they must pass through the identification.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:6999px; width:416px; height:47px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">Privacy</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">: The voting operation should stand secret, namely it is probabilistically
<br>impossible to learn which one deliver the ballots. Moreover, one could not find out
<br>the number of the ballots a candidate gains directly.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:7046px; width:392px; height:15px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">Coercion-Resistance</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">: A coercer has no way of checking in the BEV whether the
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:6348px; width:415px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:7185px; width:595px; height:841px;"></span>
<div style="position:absolute; top:7185px;"><a name="9">Page 9</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:7227px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:7226px; width:52px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 9 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:7267px; width:194px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">victims follow the demand or disobey it.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:7282px; width:416px; height:47px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">Transparent Auditability</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">: This property allows the public even without voting
<br>rights to download the blockchain of the election and help to audit and verify the
<br>results.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:7329px; width:416px; height:62px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">System Robustness </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[20]: The BEV should be able to support a large-scale
<br>national election, which requires the high system currency and process ability.
<br>Furthermore, the robustness demands the ability of system continuing to run when
<br>confronting the malicious attacks.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:7392px; width:416px; height:47px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">Receipt-Freeness</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">: A voter could not generate a receipt that allow he or she to
<br>demonstrate to a third-party for voting a certain candidate, which could prevent
<br>cash-for-votes.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:7438px; width:392px; height:15px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">Unreusability</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">: A candidate could not cast the ballots receiving from other voters
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:7470px; width:392px; height:15px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">Affordability</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">: the voting fee both for the voters and election holders should be
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:7454px; width:86px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">to another person.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:7485px; width:52px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">affordable.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:181px; top:7514px; width:233px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">III. Brief Review on B lockchain
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:7540px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">In order to understand this paper easier, it is necessary to take a review on
<br>blockchain. Since blockchain technology is popularized by the digital currency
<br>Bitcoin firstly, we take the Bitcoin as an example.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:7587px; width:366px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">When a transaction takes place, central authority or accounting intermediary
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:7602px; width:413px; height:140px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">keeps track of the transaction with detailed record in traditional system. However, it
<br>still suffers from the inherent drawback such as mediating disputes [6]. Hence, in the
<br>idea of Nakamoto [7], blockchain serves as a distributed database or joint register of
<br>all transaction. When two agents wish to engage in a transaction, they first broadcast
<br>this signal to all the self-organized network (often P2P network). Then all the nodes in
<br>the network will try to verified and final record it on their ledger if it passes the
<br>verification, thus bypassing a central bank to record it. Each individual node
<br>contributes to maintaining the public blockchain by updating their own ledger (Fig.
<br>1).
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:220px; top:7838px; width:155px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 1 blockchain maintaining process
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:7861px; width:169px; height:18px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">3.1 The Distributed network
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:7240px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:184px; top:7745px; width:225px; height:89px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:8077px; width:595px; height:841px;"></span>
<div style="position:absolute; top:8077px;"><a name="10">Page 10</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:8118px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:8118px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 10 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:8159px; width:417px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The physical basis blockchain is peer-to-peer distributed network. Varying from
<br>the C/S construction, it is a decentralized network architecture with a higher data
<br>transfer rate and security [8]. One of the characteristics of distributed network is that
<br>each node equals to one another and there are not nodes owing the privilege to control
<br>or manage other nodes. The chart of a general distributed networks are as follows:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:8383px; width:204px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 2 A general unstructured distributed network
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:319px; top:8383px; width:169px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 3 An DHT based distributed network
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:8397px; width:416px; height:105px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">However, an unstructured distributed network (see Fig. 1) seems to suffer from
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">signaling flood frequently, hence, to solve this problem, various kinds of structured
<br>networks are arisen. A distinguishing feature of DHP based structured network (see
<br>Fig. 2) is that it adopts a hash table to map computer resources and address together,
<br>hence improving the rate of data transfer and avoid data floods to some extent.
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">3.2 Transaction
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:8512px; width:395px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">When two agents decide to make a deal, the sender should first encrypt the
<br>transaction message using cryptographic techniques in order to protect
<br>their
<br>privacy.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:8562px; width:168px; height:16px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">3.2.1 </span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Public Key Cryptography </span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">[9]
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:8581px; width:416px; height:124px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">One of the famous and widely-used cryptographic techniques is public key
<br>cryptography. When one wants to convey a message to another through the internet,
<br>the sender could encrypt it by the public key of receiver, then, the receiver gets the
<br>ciphertext and read it with his private key while the public keys are transparent and
<br>private keys are private as the name suggest. Moreover, senders can apply their
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">private key to encrypt the message as digital signature and deliver it with original text.
<br>Hence receivers could decrypt the digital signature with the public key of the sender,
<br>thus marks the message as genuine by compare the solution with the original text.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:8706px; width:416px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">In the blockchain model, each node owns both private key and public key. While
<br>the public key is open, the private should be strongly preserved. As it is suggested by
<br>Huang. Z[8], the public key can be derived from private key employing SECP256K1
<br>algorithm. With the public key, one can deduce the wallet address of the key owner by
<br>base58 coding algorithm (Bitcoin for example). The procedure is as follow:
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:8132px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:78px; top:8256px; width:198px; height:125px;"></div><div style="position:absolute; border: figure 1px solid; writing-mode:False; left:302px; top:8243px; width:201px; height:113px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:8968px; width:595px; height:841px;"></span>
<div style="position:absolute; top:8968px;"><a name="11">Page 11</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:9010px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:9010px; width:57px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 11 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:156px; top:9224px; width:283px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 4 Private key, public key, wallet address transmitting relationship
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:9241px; width:272px; height:16px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">3.2.2 </span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Elliptic Curve Cryptography and Hash Algorithm
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:9260px; width:416px; height:109px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">In 1985, Victor Miller and Neil Koblitz employed the Elliptic Curve to the public
<br>key cryptosystems which made progress and is adopted by Nakamoto as one of the
<br>techniques in blockchain (SECP256K1). As the investigation of Surhone L.M showed
<br>that the security of elliptic curve cryptography (EEC) is based on the elliptic curve
<br>discrete logarithm problems (ECDLP) which has no sub-logarithmic algorithm to
<br>solve, hence results in shorter key lengths than RSA and DSA but same security
<br>[10].(For more detail of the principle of EEC, please refer to the Appendix)
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:9369px; width:420px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">One of the most important algorithms for blockchain is hash function. Huang.Z[8]
<br>visually compare the hash algorithm to the backbone of the blockchain, that is to say
<br>not only is it applied in public key cryptography but also most of procedure in
<br>blockchain such as mining.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:9431px; width:416px; height:112px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The hash algorithm used in public key cryptography is SHA256. Designed by
<br>NSA, it compresses a string of arbitrary length to a string of fixed length with
<br>immense difficulty to invert. As Selvakumar A.L. [11] declared in 2009, SHA256
<br>meets the cryptographic property requirement. It is computationally infeasible to find
<br>second two distinct inputs that hash to a same output. Moreover, it has been widely
<br>proved as invulnerable to various kinds of cyberattack [11,12].
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">3.2.3 </span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">The Data Structure of Transaction Record
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:9547px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">During a Bitcoin transaction, the payers first generate a transaction record like
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:9562px; width:24px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Fig.5
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:232px; top:9720px; width:131px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 5 Bitcoin transaction record
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:9024px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:180px; top:9058px; width:258px; height:156px;"></div><div style="position:absolute; border: figure 1px solid; writing-mode:False; left:224px; top:9581px; width:169px; height:133px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:9860px; width:595px; height:841px;"></span>
<div style="position:absolute; top:9860px;"><a name="12">Page 12</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:9902px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:9902px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 12 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:9943px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">In the above sheet, there are information &quot;In&quot; and &quot;out&quot; that show the origin and
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:9958px; width:222px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">destination of the Bitcoins used in transaction.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:9974px; width:395px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">1. Previous tx means the block ID (usually a hash) where the Bitcoins come
<br>from. If the Bitcoins ready to pay has origins more than one, then there must
<br>be several number of &quot;In&quot; accordance to the number of the origins.
<br>Index: the attribute &quot;index&quot; refers to the index of origin of Bitcoins ready to
<br>pay. One can easily backtrack the Bitcoins with index and previous tx.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:10021px; width:9px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">2.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:10052px; width:303px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">3. Scriptsig: the digital signature of the payer
<br>4. Value: the total value of the transaction, a Satoshi one unit.
<br>5.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:132px; top:10083px; width:374px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">scriptPubkey: the public key of payee. The wallet address can be derived
<br>from the Pubkey.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:10117px; width:259px; height:16px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">3.2.4 </span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">The Verification and Broadcast of Transaction
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:10136px; width:416px; height:93px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">As the following figure show, the attribute Scripsig is the script of the digital
<br>signature and is convey together with the original data such as the wallet address, the
<br>value of the Bitcoin transfer and the public key of the payees et.al (by ciphertext).
<br>Then, the digital signature is created by encrypting the above original data with the
<br>private key of the payers. Finally, the original data, digital signature and the public
<br>key of the payers are delivered together to the distributed network.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:202px; top:10418px; width:190px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 6 The procedure of creating a transaction
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:10432px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The closet nodes in the network will first gain the transaction record and then
<br>verify it using the digital signature, original data and the public key. By decrypt the
<br>digital signature with the public key and compare the original data to the plain text
<br>solved above. If both are the same, then the node finishes the first verification phase.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:10495px; width:416px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Secondly, the nodes receiving the transaction will verify the feasibility of the
<br>transaction. As it is mentioned above, the origin and destination of each transaction is
<br>recorded in the &quot;in&quot; and &quot;out&quot;, hence, the node could track back in &quot;in&quot;, and check
<br>whether there are enough Bitcoins for the payments in the last transaction where the
<br>Bitcoins ready to pay come.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:10573px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">If all these verifications are done, then the nodes gaining the transaction will help
<br>to broadcast it to other nodes next to them who would do the same examinations
<br>above and broadcast it in the same way unless more than 51% of the whole nodes
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:9916px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:182px; top:10232px; width:253px; height:182px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:10752px; width:595px; height:841px;"></span>
<div style="position:absolute; top:10752px;"><a name="13">Page 13</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:10794px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:10794px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 13 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:10835px; width:416px; height:59px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">confirm it.. Otherwise, the transaction would be sent back to the payer node with a
<br>error notification and the request of broadcast will be rejected.
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">3.3 The Data Structure of the Block
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:10903px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">If compare the Blockchain to a ledger, then a block was one page. A general view
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:10919px; width:261px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">of blockchain and block structure is described as Fig.7
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:222px; top:11107px; width:151px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 7 the data structure of the block
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:11122px; width:416px; height:128px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Nodes on the network regularly consider the longest chain to be the correct one
<br>and will maintain a copy on the disk and keep working on it. Since it is so impractical
<br>to keep all the data of every block in a PC, some users of nodes only need to keep the
<br>copy of the block headers of the longest chain. Although it is possible that there are
<br>two chain with same length in the net Simultaneously, the nodes will work on the
<br>chain they received first and keep a copy of another. The tie will last until another
<br>block is created and one of the branches become longer [6].
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Timestamp and Timestamp Server:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:11253px; width:416px; height:65px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Timestamp as one of the authentications of the data in every block is produced
<br>by a timestamp server. The timestamp proves that the data have existed in a certain
<br>time[6].
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Block Body:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:113px; top:11321px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The Block Body is mainly composed of the transactions collected from the
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:11337px; width:62px; height:34px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">networks.
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Merkle root:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:11374px; width:416px; height:109px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Derived from the transactions collected in the block, the Merkle root includes all
<br>the information of the transactions. The computation process of Merkle root is a
<br>Merkle tree: Firstly, every transaction in the block will turn to a hash by the hash
<br>algorithm (usually the SHA256), Then the hashes produced above will be hash once
<br>again two by two until there is only two hashes leave. Finally the Merkle root is
<br>hashed from the final two hash [6]. An example of a computation process of the
<br>Merkel from four transactions block is as Fig.8:
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:10808px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:106px; top:10941px; width:381px; height:156px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:11644px; width:595px; height:841px;"></span>
<div style="position:absolute; top:11644px;"><a name="14">Page 14</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:11686px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:11686px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 14 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:194px; top:11931px; width:206px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 8 The Computation Procedure of Merkle root
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:11945px; width:416px; height:96px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Furthermore, the Merkle root, as proposed by Nakamoto, is applied to compact
<br>the size of the block. When the latest transaction in a coin is buried under adequate
<br>blocks, then the spent transaction before it can be discarded to save the disk space.
<br>With Merkle, the block hash (block ID) would not change even some transaction with
<br>less necessity.
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Block ID:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:12045px; width:416px; height:81px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The block ID, block hash as well, is calculated from the Timestamp, block hash
<br>of previous block, Merkle root and a nonce by hash them together in a hash function.
<br>When a miner in the network pass the consensus algorithm successfully, then a new
<br>block is created with the block hash calculated before.
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Nonce:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:12129px; width:416px; height:96px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">A Nonce is a random number, generated during the process of producing a block,
<br>to create a qualified block hash. When a miner successfully passes the PoW (a
<br>consensus algorithm), then it must broadcast the block it created exactly to all the
<br>node to verify it. The node gains the result will use the nonce to create a block ID and
<br>check whether it meets the target [2].
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Difficulty:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:12229px; width:416px; height:93px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">In order to maintain the generation circulation of blocks to ensure each block
<br>owns almost the same size, the Bitcoin blockchain introduces difficulty based on the
<br>average computing power of the network. Bitcoin blockchain adjusts the degree of
<br>difficulty whenever 2016 blocks have been established, hence ensuring the circulation
<br>of creating a block is 10 minutes approximately. The difficulty is adjusted according
<br>to the following formula:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:111px; top:12305px; width:301px; height:66px;"><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> 箰᥇ ݅  ݂݅ ݅ ܿ  </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> ݅᥇ ݅  ݂݅ ݅ ܿ  ݂   ݅ ݅᜷箰݂얰᜷ 얰 ݅ ᜷  얰᜷  ݅얰݂耀᜷
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:287px; top:12322px; width:50px; height:47px;"><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> 얰᜷  ᜷얰᜷݅᜷
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:447px; top:12330px; width:30px; height:15px;"><span style="font-family: WRGGGP+DengXian-Regular; font-size:14px">（</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">1</span><span style="font-family: WRGGGP+DengXian-Regular; font-size:14px">）
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:12363px; width:227px; height:43px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">3.4 Procedure of Adding A New Block
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">3.4.1 </span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Miners and Incentive
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:11700px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:114px; top:11729px; width:373px; height:197px;"></div><span style="position:absolute; border: black 1px solid; left:214px; top:12339px; width:197px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:12536px; width:595px; height:841px;"></span>
<div style="position:absolute; top:12536px;"><a name="15">Page 15</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:12578px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:12578px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 15 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:12618px; width:416px; height:93px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">All the nodes participant in adding new block to the existing blockchain owns a
<br>reserve blocks themselves. They sniffs the whole network for transactions and then
<br>put the transactions they collected in their reserve blocks, calculating the Merkle roots
<br>Simultaneously as well as block hash until the reserve blocks is full, then miners will
<br>continue calculating the block hash unless the block hash meets the target or other
<br>nodes successfully reach the target[8] (see Fig.9).
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:176px; top:12916px; width:243px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 9 The procedure of miners and the way block creating
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:12930px; width:416px; height:65px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Every node succeeds in adding a node to the blockchain will gain a certain
<br>number of Bitcoins. Hence there are always passion for some nodes to devote in the
<br>above work, which are vividly mentioned as mining.
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">3.4.2 </span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Consensus Algorithm
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:12999px; width:416px; height:124px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">In order to prevent inconsistency of the copies on the whole network, it is
<br>necessary to establish a mechanism to ensure that the establishment of blocks is
<br>agreed by the whole network. In numbers of cryptographic protocols, provers tend to
<br>convince verifiers that
<br>that a certain
<br>mathematical relation holds correct. On the contrary, in the proof of work mechanism
<br>employed by the Bitcoin Blockchain to guarantee a unique ledger (blockchain),
<br>provers demonstrate to the verifiers that they have finished certain amount of work in
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">specified interval of time [13].
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:215px; top:13046px; width:211px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">they possess knowledge of a secret or
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:13124px; width:163px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The principle of Pow is as follow:
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:12592px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:234px; top:12719px; width:150px; height:188px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:13428px; width:595px; height:841px;"></span>
<div style="position:absolute; top:13428px;"><a name="16">Page 16</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:13470px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:13470px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 16 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:238px; top:13699px; width:117px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 10 The principle of PoW
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:13713px; width:416px; height:109px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">When a miner has created a reserve block, what he wants to do is to demonstrate
<br>his reserve block to other nodes and thus have a chance to add the blockchain with his
<br>reserve block so as to gain his reward, which might results in multiple versions of
<br>blockchain. Hence, the PoW is applied in the Bitcoin to solve this problem. As Fig.10
<br>shown above, after specify numbers of blocks (2016 for Bitcoin) have been added, the
<br>network target will change corresponding to the difficulty which will change as the
<br>formula (1) shown before.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:13822px; width:416px; height:124px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">By modify the nonce in the head of reserve block randomly, the requirement that
<br>target must less then network target will be met with a certain nonce. Hence, a node
<br>with more computing power could be faster to meet the requirement because it tests
<br>more nonce in same interval of time. When a node succeed in gaining a solution, it
<br>will first delivered the block head and nonce to other nodes next to it who will stop
<br>mining to check whether the nonce with the block head accordingly is qualified by
<br>just doing a hash algorithm to the above two data and comparing the result to the
<br>network target.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:13947px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">With most of the node confirm the qualification of the nonce, the reserve block
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:13963px; width:176px; height:43px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">will then be added to the blockchain.
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">3.5 General Model of Bitcoin
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:14016px; width:416px; height:109px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">All above, blockchain is physically based on distributed network. Each node in
<br>the network will generate transactions which encrypted as ciphertext and broadcast to
<br>the whole network. Each node getting the transaction will check its credibility and
<br>contribute to transfer it or stop it. Miners, playing a role in packing the transactions to
<br>a block and adding to the blockchain, never stop sniffing the information transmitting
<br>in the network and struggling to colliding a nonce to meet the consensus algorithm to
<br>makes their fortune.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:14125px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">There are some points worth paying attention. New transaction do not necessary
<br>to transfer to every node. As long as they reach many nodes, they will eventually get
<br>into a block before long. Nodes always account for the longest chain and keep it. If
<br>there are different versions of blockchain, the nodes will stick to the first one they got,
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:13484px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:155px; top:13517px; width:308px; height:173px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:14320px; width:595px; height:841px;"></span>
<div style="position:absolute; top:14320px;"><a name="17">Page 17</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:14362px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:14362px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 17 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:14402px; width:380px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">and keep a copies of other versions until the longest blockchain takes place [6].
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:231px; top:14622px; width:133px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 11 General Model of Bitcoin
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:14680px; width:416px; height:116px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">IV. The Underlying Design Models Based on Blockchain
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Each ballot must go through a third-party authority like auditing bureau to record
<br>it on the traditional remote e-voting systems (REV). Hence compared to the currency
<br>system, this paper proposes a blockchain-enabled voting (BEV) system mainly similar
<br>to Bitcoin technology despite some disputes.
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">4.1 Bitcoin to Bitpoll
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:14806px; width:416px; height:65px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">supposing that the procedure of voting as a transaction, namely one votes for
<br>somebody is to give the Bitpoll he owns to the person he votes for. Then we can
<br>adhere mainly to the construction of Bitcoin.
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">4.1.1 Distribution of Bitpoll
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:14875px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Different from the Bitcoin which generated by mining, the Bitpolls must be
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">delivered to all the voters when the election begins. Hence, in this paper, the first
<br>block of the blockchain is not created by a miner but the authority. In the first block,
<br>there are operations in the block body that give every voter a Bitpoll.
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:14375px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:118px; top:14419px; width:357px; height:201px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:15212px; width:595px; height:841px;"></span>
<div style="position:absolute; top:15212px;"><a name="18">Page 18</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:15254px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:15254px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 18 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:218px; top:15498px; width:158px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 12 The initial distribution of Bitpoll
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:15512px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">In the above figure, the operations in the first block is to deliver a Bitpoll to
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:15528px; width:221px; height:34px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">every electors.
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">4.1.2 Voting Operation and Bitpoll Structure
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:15565px; width:416px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The payments of Bitcoins are not so much based on the balance as the records of
<br>previous transactions of the Bitcoins to pay [8]. Every Bitcoin can date back to its
<br>original block where there is a record noting how the Bitcoin is born (always
<br>generates as a reward for miners). Suppose there is a transaction which is created by
<br>the activity that A pays B 10 Bitcoins:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:193px; top:15816px; width:209px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 13 A transaction record created by a payment
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:15831px; width:416px; height:93px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Suppose A has 12 Bitcoins totally. 9 coins comes from &quot;In 1&quot; where one can
<br>track back to the last transaction of the coins and the original block if he or she likes.
<br>The other 3 could be dated from &quot;In 2&quot;. Since 9 coins absolutely not enough to pay B,
<br>the transaction must be composed of both &quot;In&quot;. The transaction must consist of two
<br>&quot;Out&quot; one for B while another for changing for the sake of maintaining the
<br>continuities of these Bitcoins.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:15924px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Therefore, it is significant to describe the voting operation since Bitpoll is similar
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:15940px; width:50px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">to Bitcoin.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:15955px; width:327px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">This paper proposes the data structure of voting operation as follow:
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:15267px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:162px; top:15296px; width:293px; height:199px;"></div><div style="position:absolute; border: figure 1px solid; writing-mode:False; left:214px; top:15650px; width:189px; height:158px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:16104px; width:595px; height:841px;"></span>
<div style="position:absolute; top:16104px;"><a name="19">Page 19</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:16146px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:16145px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 19 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:228px; top:16421px; width:138px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 14 voting operation structure
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:16436px; width:392px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Similar to Bitcoin transactions, the meaning of attributes are as follows:
<br>Previous Operation: the block hash of the last operation of Bitpoll (usually the
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:16467px; width:52px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">first block)
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:16482px; width:392px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Index: to locate the exact position of the last operation in the block.
<br>Digital Signature: with the same cryptography, it is generated by encrypt the
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:16514px; width:298px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">original data of the operation with the private key of the voter.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:16529px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Public Key: the public key of candidate, one can deduce the ballots box address
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:16545px; width:287px; height:34px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(namely wallet address for Bitcoin) using base58 algorithm.
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">4.1.3 Protocol to Prevent Bitpoll Reuse
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:16582px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Unlike the Bitcoin, Bitpoll once be delivered to a person, it can not be sent to
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:16598px; width:152px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">other by the person receiving it.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:167px; top:16786px; width:262px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 15 Ban If there are candidates reusing other voters' ballots.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:16816px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">This rule could be realized by demanding that the Bitpoll convey to a certain
<br>ballots box must check it &quot;in&quot; first. Nodes close to the voter node receive the voting
<br>operation broadcast will check whether this Bitpoll is from the first block of the
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:16159px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:192px; top:16189px; width:233px; height:228px;"></div><div style="position:absolute; border: figure 1px solid; writing-mode:False; left:161px; top:16614px; width:271px; height:169px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:16996px; width:595px; height:841px;"></span>
<div style="position:absolute; top:16996px;"><a name="20">Page 20</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:17037px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:17037px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 20 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:17078px; width:416px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">blockchain. If not, then the nodes refuse to broadcast the operation and send a error
<br>information to the voters (see Fig. 16)
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:183px; top:17376px; width:229px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 16 Procedure Diagram on preventing Bitpoll abuse
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:17399px; width:146px; height:18px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">4.2 Miners and incentive
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:17427px; width:416px; height:93px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Be opposed to Bitcoin, there seems to be no one being volunteered to practice
<br>complex calculations to create block and add it to the blockchain of Bitpoll which will
<br>results in poor recording of voting operations. Therefore, on the condition of adopting
<br>the PoW as the consensus algorithm, the present paper proposes that, since Bitpoll do
<br>not have the property of consuming, the reward for block creator relies on the
<br>government with cash. Thus, add an incentive for nodes to support the blockchain.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:17717px; width:94px; height:18px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">4.3 Registration
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:255px; top:17694px; width:85px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 17 The Incentive
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:113px; top:17745px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">While the owners of Bitcoin might have several virtual wallet addresses, the
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:17051px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:202px; top:17110px; width:213px; height:261px;"></div><div style="position:absolute; border: figure 1px solid; writing-mode:False; left:146px; top:17522px; width:302px; height:170px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:17887px; width:595px; height:841px;"></span>
<div style="position:absolute; top:17887px;"><a name="21">Page 21</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:17929px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:17929px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 21 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:17970px; width:416px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">ballots box address for Bitpolls must be only one, that is only the eligible nodes can
<br>vote.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:283px; top:18158px; width:27px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 18
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:18173px; width:419px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">In order to prevent duplicate application for ballots boxes, there seems to be
<br>necessity of the help of a Credit Management Agency to collect the identical of voters,
<br>which goes against decentralizing as the paper recommends.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:18219px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">One of the solutions is that we can turn to existing identical management based
<br>on Blockchain to help us such as ShoCard, BitID, ID.me, and IDchainZ.[15]. In the
<br>run-up to the election, voters should deliver their identification to the ShoCard to gain
<br>a ballots boxes address.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:18282px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The process of gaining a ballots boxes address is as follows (see Fig.: take
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:18297px; width:102px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">ShoCard as example)
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:18313px; width:416px; height:124px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">During the run-up to the election, voters transmit their physical identity cards
<br>data (by scanning) to the ShoCard which save the data fingerprints in the blockchain
<br>and send back an encrypted identity information to the local disk of the voters using
<br>smart contract techniques [8,15]. No one (including ShoCard itself) is not able to alter
<br>it without the private of the owners. Thus, the duplicate application would be avoided
<br>thanks to the fingerprints in the ShoCard blockchain. And if one tries to reapply for
<br>two address, the application would be refused due to the identity record that already
<br>exists in the ShoCard.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:18572px; width:322px; height:18px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">4.4 Consensus Algorithm and Data Structure of Block
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:18600px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Like Bitcoin blockchain, the data structure of block in the blockchain has block
<br>head and block body. While the block body collects the voting operations from the
<br>network, block head contains previous block hash, timestamp, version, Merkle root
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:17943px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:160px; top:18003px; width:273px; height:151px;"></div><div style="position:absolute; border: figure 1px solid; writing-mode:False; left:156px; top:18442px; width:306px; height:116px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:18779px; width:595px; height:841px;"></span>
<div style="position:absolute; top:18779px;"><a name="22">Page 22</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:18821px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:18821px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 22 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:18862px; width:281px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">and nonce et.al. The block structure is described as Fig.19:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:251px; top:19035px; width:92px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 19 Block Structure
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:19049px; width:416px; height:105px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Similar to Bitcoin as well, the Consensus Algorithm is PoW to address the
<br>inconsistency problem in the distributed system. The difficulty will automatically be
<br>modified. Every miner who wishes to gain the money from the government must
<br>struggle to add his or her reserve block to the blockchain and broadcast it to the whole
<br>network to verify it.
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">4.5 Privacy Protection
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:19164px; width:416px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Although the Blockchain is open and transparent to the network, one is unable to
<br>recognize the identity of both voters and candidates for every voting operation is
<br>encrypted with EEC and hash function cryptography. A public key or ballots address
<br>of voters and candidates have nothing to do with the real identify. Therefore, both the
<br>voting activities and the identity of the voters will not leak to the network.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:122px; top:19431px; width:352px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 20 The other node could not recognize the exact identity in the open blockchain
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:19454px; width:197px; height:18px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">4.6 Difficulty Modifying Strategy
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:19482px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">To the contrary of Bitcoin, the difficulty of adding a block to blockchain is
<br>adjusted with the computing power of the whole network to maintain the interval of
<br>time of adding a block. However, it might be necessary for our blockchain to behave
<br>this way. The interval of time could be adjusted to suit human schedule. Considering
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:18835px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:217px; top:18879px; width:183px; height:150px;"></div><div style="position:absolute; border: figure 1px solid; writing-mode:False; left:152px; top:19249px; width:314px; height:173px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:19671px; width:595px; height:841px;"></span>
<div style="position:absolute; top:19671px;"><a name="23">Page 23</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:19713px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:19713px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 23 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:279px; top:19815px; width:60px; height:66px;"><span style="font-family: DCWGQU+CambriaMath; font-size:66px">  箰</span><span style="font-family: DCWGQU+CambriaMath; font-size:47px">   ᜷</span><span style="font-family: DCWGQU+CambriaMath; font-size:38px"> 
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:19754px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">fewer voting operation would takes place in the middle of the night, the interval of
<br>time could be increased by enhancing the difficulty. The present paper demonstrates a
<br>method to adjust the difficulty by change the interval of the time for creating block
<br>with the national/local electrical load.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:19816px; width:294px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The relationship between time and electric load is as follows:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:468px; top:19841px; width:13px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(2)
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:19863px; width:416px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">where t is the interval of time, L is the electric load of the power grid. L equals to 1
<br>means full load while 0 means no power usage.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:113px; top:19894px; width:149px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The formula (2) is described as
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:159px; top:19926px; width:5px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">60
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:159px; top:19950px; width:5px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">50
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:159px; top:19973px; width:5px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">40
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:159px; top:19997px; width:5px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">30
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:159px; top:20020px; width:5px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">20
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:159px; top:20044px; width:5px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">10
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:19961px; width:6px; height:1px;"><span style="font-family: VMBCQV+ArialMT; font-size:1px">i
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:19958px; width:6px; height:8px;"><span style="font-family: VMBCQV+ArialMT; font-size:2px">n
<br></span><span style="font-family: VMBCQV+ArialMT; font-size:4px">m
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:19967px; width:6px; height:15px;"><span style="font-family: VMBCQV+ArialMT; font-size:1px">/
<br> 
<br></span><span style="font-family: VMBCQV+ArialMT; font-size:2px">k
<br>c
<br></span><span style="font-family: VMBCQV+ArialMT; font-size:2px">o
<br>b
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:19978px; width:6px; height:1px;"><span style="font-family: VMBCQV+ArialMT; font-size:1px">l
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:19982px; width:6px; height:1px;"><span style="font-family: VMBCQV+ArialMT; font-size:1px"> 
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:19984px; width:6px; height:2px;"><span style="font-family: VMBCQV+ArialMT; font-size:2px">a
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:19987px; width:6px; height:1px;"><span style="font-family: VMBCQV+ArialMT; font-size:1px"> 
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:19988px; width:6px; height:8px;"><span style="font-family: VMBCQV+ArialMT; font-size:2px">d
<br>d
<br>a
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:19997px; width:6px; height:1px;"><span style="font-family: VMBCQV+ArialMT; font-size:1px"> 
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:19998px; width:6px; height:2px;"><span style="font-family: VMBCQV+ArialMT; font-size:2px">o
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:20001px; width:6px; height:3px;"><span style="font-family: VMBCQV+ArialMT; font-size:1px">t
<br> 
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:20004px; width:6px; height:7px;"><span style="font-family: VMBCQV+ArialMT; font-size:2px">e
<br></span><span style="font-family: VMBCQV+ArialMT; font-size:4px">m
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:20012px; width:6px; height:5px;"><span style="font-family: VMBCQV+ArialMT; font-size:1px">i
<br></span><span style="font-family: VMBCQV+ArialMT; font-size:1px">t
<br> 
<br></span><span style="font-family: VMBCQV+ArialMT; font-size:1px">l
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:20017px; width:6px; height:10px;"><span style="font-family: VMBCQV+ArialMT; font-size:2px">a
<br></span><span style="font-family: VMBCQV+ArialMT; font-size:2px">v
<br></span><span style="font-family: VMBCQV+ArialMT; font-size:1px">r
<br></span><span style="font-family: VMBCQV+ArialMT; font-size:2px">e
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:20027px; width:6px; height:1px;"><span style="font-family: VMBCQV+ArialMT; font-size:1px">t
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:20029px; width:6px; height:2px;"><span style="font-family: VMBCQV+ArialMT; font-size:2px">n
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:20032px; width:6px; height:2px;"><span style="font-family: VMBCQV+ArialMT; font-size:1px">i
<br></span><span style="font-family: VMBCQV+ArialMT; font-size:1px"> 
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:20034px; width:6px; height:5px;"><span style="font-family: VMBCQV+ArialMT; font-size:2px">e
<br>h
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:150px; top:20040px; width:6px; height:1px;"><span style="font-family: VMBCQV+ArialMT; font-size:1px">t
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:162px; top:20068px; width:2px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">0
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:165px; top:20072px; width:2px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">0
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:194px; top:20072px; width:7px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">0.1
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:225px; top:20072px; width:7px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">0.2
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:257px; top:20072px; width:7px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">0.3
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:288px; top:20072px; width:7px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">0.4
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:319px; top:20072px; width:7px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">0.5
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:303px; top:20079px; width:38px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">the electric load 
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:350px; top:20072px; width:7px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">0.6
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:382px; top:20072px; width:7px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">0.7
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:413px; top:20072px; width:7px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">0.8
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:445px; top:20072px; width:7px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">0.9
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:478px; top:20072px; width:2px; height:6px;"><span style="font-family: VMBCQV+ArialMT; font-size:6px">1
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:154px; top:20098px; width:287px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 21 The relationship between time and electric load of power grid
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:20112px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The curve above show that when the local/national power grid is full load, then
<br>in order to catch up with the soaring voting operation to maintain the block size, the
<br>interval of time should be adjusted to 1 minute.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:20159px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Suppose n is new block during the update circulation of the difficulty, ND is the
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:20149px; width:416px; height:66px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">new difficulty, and OD the previous, and </span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px">얰 </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">refers to the actual time of creating n
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:20190px; width:292px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">blocks, then the adjust formula of the difficulty is as follows:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:489px; top:20214px; width:13px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(3)
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:282px; top:20188px; width:57px; height:66px;"><span style="font-family: DCWGQU+CambriaMath; font-size:66px">   </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px">    </span><span style="font-family: DCWGQU+CambriaMath; font-size:38px">얰</span><span style="font-family: DCWGQU+CambriaMath; font-size:47px">᜷ 
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:20246px; width:86px; height:18px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">4.7 Abstention
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:20275px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">While there might be some one abstains from voting, it is necessary to set an
<br>abstention method. We command if voters do not cast away their ballots, then it is
<br>regarded as abstention automatically.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:20321px; width:416px; height:99px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">In order to avoid counting the Bitpoll left due to abstention, this paper declares
<br>that the tallying organization could only count the Bitpoll whose &quot;in&quot; does not come
<br>from the first block of the blockchain.
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">4.8 The Entities of Bitpoll Blockchain
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Registration Server</span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:15px">:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:20424px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The roles of registration server is to register eligible voters and prevent duplicate
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:19727px; width:415px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:313px; top:19842px; width:2px; height:7px;"></span>
<span style="position:absolute; border: black 1px solid; left:331px; top:19842px; width:2px; height:7px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19929px; width:313px; height:141px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19929px; width:313px; height:141px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19929px; width:313px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:19929px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:20071px; width:313px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:20071px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:19929px; width:0px; height:141px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:19929px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19929px; width:0px; height:141px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19929px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:20071px; width:313px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:20071px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19929px; width:0px; height:141px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19929px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:20067px; width:0px; height:3px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:20067px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19929px; width:0px; height:2px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19932px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:197px; top:20067px; width:0px; height:3px;"></span>
<span style="position:absolute; border: black 1px solid; left:197px; top:20067px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:197px; top:19929px; width:0px; height:2px;"></span>
<span style="position:absolute; border: black 1px solid; left:197px; top:19932px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:229px; top:20067px; width:0px; height:3px;"></span>
<span style="position:absolute; border: black 1px solid; left:229px; top:20067px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:229px; top:19929px; width:0px; height:2px;"></span>
<span style="position:absolute; border: black 1px solid; left:229px; top:19932px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:260px; top:20067px; width:0px; height:3px;"></span>
<span style="position:absolute; border: black 1px solid; left:260px; top:20067px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:260px; top:19929px; width:0px; height:2px;"></span>
<span style="position:absolute; border: black 1px solid; left:260px; top:19932px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:292px; top:20067px; width:0px; height:3px;"></span>
<span style="position:absolute; border: black 1px solid; left:292px; top:20067px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:292px; top:19929px; width:0px; height:2px;"></span>
<span style="position:absolute; border: black 1px solid; left:292px; top:19932px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:323px; top:20067px; width:0px; height:3px;"></span>
<span style="position:absolute; border: black 1px solid; left:323px; top:20067px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:323px; top:19929px; width:0px; height:2px;"></span>
<span style="position:absolute; border: black 1px solid; left:323px; top:19932px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:354px; top:20067px; width:0px; height:3px;"></span>
<span style="position:absolute; border: black 1px solid; left:354px; top:20067px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:354px; top:19929px; width:0px; height:2px;"></span>
<span style="position:absolute; border: black 1px solid; left:354px; top:19932px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:385px; top:20067px; width:0px; height:3px;"></span>
<span style="position:absolute; border: black 1px solid; left:385px; top:20067px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:385px; top:19929px; width:0px; height:2px;"></span>
<span style="position:absolute; border: black 1px solid; left:385px; top:19932px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:417px; top:20067px; width:0px; height:3px;"></span>
<span style="position:absolute; border: black 1px solid; left:417px; top:20067px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:417px; top:19929px; width:0px; height:2px;"></span>
<span style="position:absolute; border: black 1px solid; left:417px; top:19932px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:448px; top:20067px; width:0px; height:3px;"></span>
<span style="position:absolute; border: black 1px solid; left:448px; top:20067px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:448px; top:19929px; width:0px; height:2px;"></span>
<span style="position:absolute; border: black 1px solid; left:448px; top:19932px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:20067px; width:0px; height:3px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:20067px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:19929px; width:0px; height:2px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:19932px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:20071px; width:2px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:169px; top:20071px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:20071px; width:3px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:20071px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:20047px; width:2px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:169px; top:20047px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:20047px; width:3px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:20047px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:20023px; width:2px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:169px; top:20023px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:20023px; width:3px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:20023px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:20000px; width:2px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:169px; top:20000px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:20000px; width:3px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:20000px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19976px; width:2px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:169px; top:19976px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:19976px; width:3px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:19976px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19953px; width:2px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:169px; top:19952px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:19953px; width:3px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:19952px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19929px; width:2px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:169px; top:19929px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:19929px; width:3px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:476px; top:19929px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19929px; width:313px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:19929px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:20071px; width:313px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:20071px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:19929px; width:0px; height:141px;"></span>
<span style="position:absolute; border: black 1px solid; left:480px; top:19929px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19929px; width:0px; height:141px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19929px; width:0px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:166px; top:19942px; width:313px; height:126px;"></span>
<span style="position:absolute; border: black 1px solid; left:314px; top:20222px; width:25px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:20563px; width:595px; height:841px;"></span>
<div style="position:absolute; top:20563px;"><a name="24">Page 24</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:20605px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:20605px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 24 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:20645px; width:416px; height:50px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">registrations of voters. In order to decentralize, this paper proposes to work with the
<br>identity management blockchain like Shocard.
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Eligible voters:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:20698px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Each voter owns a ballots box with a initial Bitpoll distributed by the first block.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:20714px; width:367px; height:34px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">They have the rights to cast their initial Bitpolls to other ballots box address.
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Miners:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:20751px; width:416px; height:81px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The miners play an important role in supporting the network. They never stop
<br>collecting the voting operations and pack it to a reserve block. Then tempted by the
<br>incentive, they will struggle to do hash calculations and add their reserve block to the
<br>blockchain.
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Tallying Authority:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:20836px; width:416px; height:162px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">With the transparent and open blockchain, one could easily find out which is the
<br>finalist. While it is time impractical for a person to do all the statistic work, hence
<br>there must be some organization to do the jobs. Although it seems go against the
<br>principle of decentralization, the tallying authority could not practice fraud because of
<br>the open and transparent blockchain. The Tallying Authority could be trusted
<br>third-party authorities, other organization work for social interest or the modest or
<br>large scale parties.
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">4.9 Election Stage
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Registration Phase
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:113px; top:21001px; width:376px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">This phase takes place in a registration server which mentioned above. A voter
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:21017px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">would gain ballots box address, public key and private key from the identify
<br>management blockchain like Shocard after verifying his or her legitimacy by scanning
<br>his identification like ID cards.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:21222px; width:126px; height:16px;"><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Initial Distribution Phase
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:216px; top:21205px; width:163px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 22 The sketch of registration phase
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:21241px; width:416px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">As soon as the voters register successfully, they broadcast a information to all the
<br>network. Different from the voting operation, this information is to create a Bitpoll to
<br>their ballots box address. The information will finally reach to the miners. Different
<br>from other block as well, this block must be created at the time the voter registration
<br>is over, which can make sure most of the information is pack by the miner. Then the
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:20619px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:181px; top:21070px; width:232px; height:126px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:21455px; width:595px; height:841px;"></span>
<div style="position:absolute; top:21455px;"><a name="25">Page 25</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:21497px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:21497px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 25 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:21537px; width:186px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">first block of the blockchain generates.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:168px; top:21726px; width:260px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 23 The first block creation phase and distribution of Bitpoll
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:21743px; width:66px; height:16px;"><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Voting Phase
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:21762px; width:217px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">During the election, voters can transfer
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:21762px; width:416px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">to the candidates
<br>broadcasting the voting operation to the closet nodes. After passing the verification
<br>like Bitcoin mentioned in 3.2.4, the voting information will reach to miners who will
<br>pack it to the reserve block. After competing for adding their block, miners will
<br>contribute to save the voting operation record to the blockchain (3.4.1/3.4.2).
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:340px; top:21762px; width:64px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">their Bitpoll
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:22030px; width:41px; height:16px;"><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Tallying
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:228px; top:22013px; width:139px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 24 the sketch of voting phase
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:22049px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The tallying organization take charge of counting the amount of Bitpoll of every
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:22065px; width:94px; height:34px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">ballots box address.
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">Verification
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:113px; top:22102px; width:371px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">After selecting the ballots box address with most amount of Bitpoll,
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:22118px; width:371px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">candidates should use its private key to verify it. And finally end the election.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:491px; top:22102px; width:14px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">the
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:22162px; width:416px; height:52px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">V. Possible Problems of Blockchain Technology in REV and
<br>Improvements
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:21511px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:162px; top:21556px; width:293px; height:165px;"></div><div style="position:absolute; border: figure 1px solid; writing-mode:False; left:179px; top:21842px; width:260px; height:168px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:22347px; width:595px; height:841px;"></span>
<div style="position:absolute; top:22347px;"><a name="26">Page 26</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:22389px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:22435px; width:76px; height:18px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">5.1 Incentive
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:22389px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 26 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:22464px; width:416px; height:109px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Due to the huge financial cost, monetary incentive systems are impractical for
<br>large-scale national elections [4,16]. Some other BEV systems like VYV [17], Mc
<br>Corry, et.al.[18] based on Ethereum charge both voters and the election holders with
<br>ETH, which might be an enormous number for a large-size election. However,
<br>without incentive, there seems to be few computers packing the voting operation into
<br>a reserve block and trying to add it to the blockchain after solving some complex
<br>mathematical calculation, which might consume amount of electrical resources.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:22573px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">In order to solve it, the present paper consider to turn the incentive into an
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:22588px; width:408px; height:43px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">obligation, that is to command the election parties to work as miners the without pay.
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">5.2 Consensus Algorithm
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:22641px; width:419px; height:109px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Creating a block based on proof-of-work, one has to finish a certain number of
<br>calculations, which seem to waste energy resources. Another problem arose by PoW
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">might be that if there are some cooperating groups of attacker nodes whose computing
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">power is more than 51% of the average of the network, then they might change the
<br>block as they like. Moreover, the PoW consensus Algorithm might contribute to
<br>expanding the powerful mine pools and eliminating the pools with poor mining power,
<br>which tend to go against the decentralization [6,14,19].
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:22751px; width:416px; height:184px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Considering the problems caused by PoW, one of the solutions is to adopt
<br>another consensus algorithm. Like Proof-of-Share, one who owns Bitpolls more and
<br>longer than other would be easier to add his or her reserve block to the blockchain,
<br>which could reduce waste of computing power and prevent centralize to some extent.
<br>On the other hand, we can adjust the hash function used in calculating the block
<br>hash[14] to restrain the ASIC mining pools, the mainstream of mining machines,
<br>designed by specify circuit. One of the modified algorithms is HVC paralleled
<br>algorithm, which can reduce the computing ability of ASIC mining pools because this
<br>algorithm is hard to be solve using ASIC mining machines. The Scrypt algorithm
<br>which relied mainly on RAM could prevent the existing mining pools as well [19].
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">5.3 Security [19]
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:107px; top:22944px; width:399px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">According to the technical feature of blockchain, we can divide the blockchain
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:22960px; width:249px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">security model into seven layers described in Fig.25
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:186px; top:23101px; width:222px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 25 Seven layers of blockchain for security analysis
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:22403px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:154px; top:22976px; width:287px; height:123px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:23239px; width:595px; height:841px;"></span>
<div style="position:absolute; top:23239px;"><a name="27">Page 27</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:23281px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:23281px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 27 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:23321px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The infrastructure layer is the underlying systems of the network. Although the
<br>blockchain technique could resist the damage caused by malicious control of few
<br>nodes, if network vulnerability makes hackers easy to control the majority, then the
<br>whole blockchain would still suffer from danger.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:23384px; width:416px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The Cryptography layer plays an important role in keep the integrity, availability
<br>and confidentiality of a blockchain system. Blockchain technique, strongly depends
<br>on cryptology such as asymmetric algorithm and hash algorithm, which are relatively
<br>safe but not absolutely. The method to protect this layer is to update the cryptograph
<br>to catch up the hardware.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:23462px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">A blockchain system can be attacked on the communication layer because the
<br>P2P network is so open that it may cause some security problems. Attackers can
<br>launch eclipse attack, hacking attack and DDoS attack, etc. on some nodes in a P2P
<br>network and them pollute the whole network.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:23524px; width:416px; height:93px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Blockchain systems can be grouped into two categories: public chain and license
<br>chain. Both need corresponding consensus mechanism to make sure that the last block
<br>in the chain could illustrate the state of the total network. Bitcoin system, stands for
<br>public chain, applies proof of work (PoW) as its consensus mechanism. However,
<br>once the total computational power is too small that attackers can easily hijack the
<br>network, according to 51% principle.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:23618px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Smart contract virtual machines, where smart contract of blockchain runs on,
<br>may have some flaws that could be attacked, which would cause serious security
<br>problems on platform layer.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:23664px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Smart contract actually is a piece of code that runs in the blockchain network, so
<br>it may have bugs that bring safety risk. Nowadays attack aiming at smart contract is
<br>reentrancy attack,
<br>transaction sequential dependency attack and time stamp
<br>dependency attack, etc.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:23727px; width:416px; height:93px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Various kinds of conventional security problems happen in the application layer
<br>because it is involved into different industries and has many interfaces. In fact, most
<br>risks in this layer have no relationship with blockchain itself, but the weakness of
<br>algorithm, application and platform. Therefore, while improving the safety level of
<br>blockchain, it is also important to enhance the infrastructure and the acknowledges of
<br>the cyber manager and coders.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:109px; top:23833px; width:377px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">VI. Optimization and Improvement on Complexity and
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:269px; top:23864px; width:56px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">Security
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:23900px; width:366px; height:43px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">6. 1Mimic blockchain contribute to the security of blockchain
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">6.1.1. Potential Security Issues in Blockchain Technology
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:23947px; width:416px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The current blockchain can be understood as simple isomorphic redundancy,
<br>where each node stores the same data [24], adopts the same consensus algorithm in
<br>each census round, and the same signature algorithm. This isomorphic static structure
<br>provides convenience for attackers and is the fundamental reason why blockchain is
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:23295px; width:415px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:24131px; width:595px; height:841px;"></span>
<div style="position:absolute; top:24131px;"><a name="28">Page 28</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:24173px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:24173px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 28 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:24213px; width:255px; height:34px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">facing security threats at present.
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">6.1.2. What is Cryptographic Sortition Technology?
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:24250px; width:419px; height:206px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Cryptography sortition is a kind of trusted and authenticated balloting in
<br>distributed network by means of decentralized method [24]. Turing prize winner Sivio
<br>Micali's Algorand Blockchain protocol applies the cryptographic sortition technology
<br>to the blockchain, where the system creates and updates a parameter called “seed” that
<br>cannot be predicted or controlled by an attacker. Sivio Micali publishes a verifiable
<br>random function (VRF) according to the seed during each round of consensus process.
<br>Each user performs the VRF with his or her private key to obtain a corresponding
<br>credential. Users whose credentials meet certain criteria are identified as validators of
<br>this consensus round, and each validator completes a block and publishes it with his
<br>credentials. In this round, the verifier with the smallest dictionary order of credentials
<br>is identified as the leader. Finally, all verifiers run the Byzantine protocol against the
<br>leader's block
<br></span><span style="font-family: FORFRJ+TimesNewRomanPS-BoldItalicMT; font-size:16px">6.1.3. What is Mimic Blockchain?
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:24459px; width:416px; height:156px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Mimic defense [25] is a new network security defense technology, whose core is
<br>dynamic heterogeneous redundancy (DHR), aiming at solving uncertain threats based
<br>on unknown loopholes, back donors or virus on the relevant application levels of
<br>network space. In the DHR consensus mechanism, each consensus node determines
<br>the consensus mechanism to be adopted and completes the consensus in each round of
<br>consensus by means of cryptographic sortition. Finally, the final consensus node of
<br>this round should be determined according to the voucher of the cryptographic
<br>sortition. That is to say, DHR adopts dynamic signature algorithm. Even if an attacker
<br>can forge a signature algorithm, the system can change it into another consensus
<br>mechanism at any time, the DHR is described as follows:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:214px; top:24757px; width:167px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 26 the principle and process of DHR
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:24771px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Mimic blockchain takes advantage of this latest technology, which might be the
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:24787px; width:346px; height:43px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">solution to the security of blockchain.
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">6.2 PoRA Consensus Algorithm to Reduce the Complexity
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:24840px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">To reduce the complexity of blockchain technology, a new consensus mechanism
<br>named proof-of-random-authority (PoRA) is designed. Different from PoW, which
<br>requires every node in the network to verify the information broadcast by the first
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:24186px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:190px; top:24619px; width:237px; height:133px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:25023px; width:595px; height:841px;"></span>
<div style="position:absolute; top:25023px;"><a name="29">Page 29</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:25065px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:25064px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 29 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:25105px; width:416px; height:93px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">miner who solves the puzzle, the verification process in PoRA is carried out by
<br>randomly chosing online nodes with a dynamic probability. The other nodes supervise
<br>the selected nodes to guarantee they are credible to some extent. Extra rewards are
<br>allocated to these chosen nodes so that spare computation power will not be totally
<br>wasted and prevent some malicious nodes from keeping online for being selected
<br>multiple times.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:254px; top:25387px; width:87px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 27 PoRA vs PoW
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:25401px; width:416px; height:109px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Compared with PoW and PoS, PoRA proposed by the article may seem to loss
<br>the property of decentration of a blockchain system since the voting result in a period
<br>is not verified by every voter but a part of them, but the randomness does compensate
<br>the loss. However, the computation power for operating PoRA is less than that for
<br>running PoW and PoS because PoRA is not dense and the time cost for PoRA is less
<br>as well. From this point of view, PoRA finds a balance between decentration and
<br>computation efficiency and it simplifies the conventional blockchain system.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:25511px; width:40px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Besides,
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:25511px; width:416px; height:74px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">the time interval and difficulty adjusting based daily electric load
<br>technique, used to design the blockchain election system for task 1, can make the cost
<br>to run a blockchain election system lower without doing harm to the security.
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">6.3 FORK-256 for Better Security
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:25595px; width:416px; height:109px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">To improve the security of blockchain election technology, some new hash
<br>function may be adopted. A function named FORK-256 is introduced in [26] in order
<br>to defense against any known attacks on hash functions. Like SHA-256, FORK-256
<br>also has a 256-bit output by inputting a word but it is generated by four parallel
<br>branches, which can be implemented in hardware but difficult to analyze the branches
<br>simultaneously. With the hardware advancing and computation power increasing,
<br>SHA-512 and FORK-512 will launch in the coming future.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:240px; top:25717px; width:114px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">VII. Conclusions
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:25743px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Although BEV system has drawbacks, it still has a tendency to develop and
<br>enhance despite many disputes. Varying from the traditional remote e-voting system,
<br>the e-voting system based on blockchain is similar to a decentralized distributed
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:25078px; width:415px; height:0px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:149px; top:25202px; width:320px; height:180px;"></div><span style="position:absolute; border: gray 1px solid; left:0px; top:25915px; width:595px; height:841px;"></span>
<div style="position:absolute; top:25915px;"><a name="30">Page 30</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:25956px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:25956px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 30 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:25997px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">database managed by the whole network, which could eliminate the fraud by the
<br>third-party authority. Besides, due to its inherent property of anonymity and
<br>transparency, it is widely deployed in soaring numbers of voting protocols.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:26044px; width:417px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The design proposed by the present paper almost solve the risk of reliance on the
<br>so-call trusted third-party authority. Even if there are still tallying organizations to do
<br>the statistic work, it is impractical to practice fraud because every node on the
<br>network owns a copy of the transparent and open blockchain.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:26106px; width:416px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">While there is still some problem like energy consuming and wastes of
<br>computing power, the article there come up with some useful techniques that might
<br>help to solve it. Moreover, there are some novel idea such as the difficulty modifying
<br>strategy and PoRA consensus algorithm, which could be taken into practice after
<br>adequate theoretical tests.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:26184px; width:416px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">All above, there are still plenty of room left for enhancement and improvement
<br>for BEV system, undoubtedly, it will be the mainstream technique in remote e-voting
<br>system in the future.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:233px; top:26244px; width:127px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">VIII. Future Work
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:26279px; width:298px; height:18px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">8.1 The limitations of the current e-voting systems
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:26307px; width:416px; height:93px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Most of the e-voting systems that employ blockchain technology to conduct
<br>online voting rely on trusted third-party to perform the auditing and managing duties
<br>during the election. For example, in 2016, Lee, James, Ejeta and Kim et al [22]. turn
<br>to a third-party in the BEV system to protect the ballots of voters. In 2017, Cruz
<br>et.al.[23]. came up with a BEV system applying blind signature technique, which also
<br>introduced a third-party counting mechanism to count the voting results.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:26401px; width:416px; height:106px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">However, no one cannot exclude the possibility of the third-party counting
<br>institutions and the managers to attack the system, which results in the tampering of
<br>voting results, or the possibility that counting institutions leaked the voting results in
<br>advance to control the change of the entire voting results. In addition, the restriction
<br>of the storage of bitcoin transactions also makes the existing BEV systems imperfect.
<br></span><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">8.2 The Smart contract in e-voting system
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:26516px; width:416px; height:124px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Smart contract, consisting of self-verification and automatic execution of
<br>contract terms, is a computer transaction protocol without intermediary, based on
<br>distributed architecture and consensus algorithm in blockchain technology, smart
<br>contract allows population without
<br>to complete transactions bypassing any
<br>third-party intermediary or authority. The emergence of Ethereum (a smart contract
<br>development platform) has changed the application pattern of blockchain and smart
<br>contract, making it no longer limited to digital currency, and starting to have the
<br>opportunity to build a broader financial system and apply it to other social fields.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:275px; top:26563px; width:21px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">trust
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:26641px; width:416px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The smart contract has the characteristics of protecting the privacy of voters and
<br>can realize self-counting when used in online voting systems. General process can be
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:25970px; width:415px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:26807px; width:595px; height:841px;"></span>
<div style="position:absolute; top:26807px;"><a name="31">Page 31</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:26848px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:26848px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 31 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:26889px; width:416px; height:124px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">simplified as: Voting promoters verify the voters through the smart contract
<br>qualification, only those who have passed the certification can be included in the
<br>voting protocol. During the voting process, smart contracts automatically submit
<br>encrypted votes to the blockchain. When the vote is completed, the voting promoter
<br>notifies the smart contract to enter the counting stage (the method of counting the
<br>votes written in the intelligent contract
<br>is invoked, without any third-party
<br>the statistical results corresponding to each candidate are
<br>participation). Finally,
<br>published in the whole system and can be verified by anyone.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:27014px; width:416px; height:78px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">The smart contract on the blockchain can realize a voting scheme with
<br>there is no participation of
<br>self-counting function. In addition to the fact
<br>third-party counting institution,
<br>it can also achieve the characteristics of public
<br>verifiability and data tamper-proof during the voting process. In the future, there will
<br>be considerable space for smart contract to develop.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:338px; top:27029px; width:17px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">that
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:26862px; width:415px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:27698px; width:595px; height:841px;"></span>
<div style="position:absolute; top:27698px;"><a name="32">Page 32</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:27740px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:27740px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 32 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:247px; top:27809px; width:100px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">VI. References
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:27835px; width:379px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[1] Benaloh J , Fischer M J . A Robust and Verifiable Cryptographically Secure
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:27851px; width:380px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Election Scheme[C]// Symposium on Foundations of Computer Science. IEEE,
<br>1985.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:27882px; width:393px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[2] Xenakis A , Macintosh A . Trust Analysis of the U.K. e-Voting Pilots[M]. Sage
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:27898px; width:113px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Publications, Inc. 2005.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:27913px; width:386px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[3] Brewer P R , Sigelman L . Trust in Government: Personal Ties that Bind?[J].
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:27929px; width:227px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Social Science Quarterly, 2002, 83(2):624-631.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:27944px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[4] Zhang, S. , Wang, L. , &amp; Xiong, H. . (2019). Chaintegrity: blockchain-enabled
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:27960px; width:338px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">large-scale e-voting system with robustness and universal verifiability.
<br></span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">International Journal of Information Security</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(2).
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:27991px; width:385px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[5] Jianshe, Z. , Peng, S. , &amp; Qing, W. U. . (2008). Research on data information
<br>indexing and searching algorithm based on DHT. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Computer Engineering &amp;
<br>Applications</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">, 44(31), 159-163.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28038px; width:407px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[6] Nakamoto S. (2008). Bitcoin: A peer-to-peer electronic cash system.
<br>[7] Pieters, G. C. , &amp; Koch, C. . (2017). Blockchain technology disrupting traditional
<br>records systems. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Economic review (Federal Reserve Bank of Dallas)</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">, 6(2), 1-3.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28085px; width:384px; height:47px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[8] Huang, Z., Lv. K., &amp; Li, H.. (2017). </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Learn the blockchain from scratch:
<br>Digital currency and new pattern of Internet finance</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">. Qinghua University Press.
<br>[9] Whitfield Diffie, &amp; Martin E. Hellman. (1976). Multiuser cryptographic
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28132px; width:372px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">techniques. American Federation of Information Processing Societies: 1976
<br>National Computer Conference, 7-10 June 1976, New York, NY, USA. ACM.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28163px; width:387px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[10] Surhone, L. M. , Tennoe, M. T. , Henssonow, S. F. , &amp; Transform, A. O. N. .
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28178px; width:301px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(2010). Elliptic curve cryptography. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Ubiquity, 2008</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(May), 1-8.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28194px; width:377px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[11] Selvakumar, A. L. , &amp; Ganadhas, C. S. . (2009). The Evaluation Report of
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28209px; width:336px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">SHA-256 Crypt Analysis Hash Function. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">International Conference on
<br>Communication Software &amp; Networks</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">. IEEE.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28241px; width:384px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[12] He R.M., &amp; Ma J.. (2014). Sha-256 Algorithm security analysis. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Electronic
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28256px; width:168px; height:15px;"><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Design Engineering</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">,22(03), 31-33.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28272px; width:369px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[13] Jakobsson, M. , &amp; Juels, A. . (1999). Proofs of Work and Bread Pudding
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28287px; width:368px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Protocols. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Secure Information Networks: Communications and Multimedia
<br>Security, IFIP TC6/TC11 Joint Working Conference on Communications and
<br>Multimedia Security (CMS '99), September 20-21, 1999, Leuven, Belgium.
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Kluwer, B.V.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28350px; width:401px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[14] Du. J. (2018). Discussion On Hasche Algorithm in block chain proof-of-work
<br>system mechanism. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Computer programming skills and maintenance</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(4), 40-42.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28381px; width:386px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[15] Paul, D. , &amp; Petitcolas, F. A. P. . (2018). A first look at identity management
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28397px; width:324px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">schemes on the blockchain. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">IEEE Security &amp; Privacy, 16</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(4), 20-29.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28412px; width:406px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[16] Heiberg, S., Kubjas, I., Siim, J., Willemson, J. (2018). On trade-offs of applying
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28428px; width:353px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">block chains for electronic voting bulletin boards. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">E-Vote-ID </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">2018, p. 259
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28444px; width:335px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[17] Chaieb, M. , Yousfi, S. , Lafourcade, P. , &amp; Robbana, R. . (2018).
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:27754px; width:415px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:28590px; width:595px; height:841px;"></span>
<div style="position:absolute; top:28590px;"><a name="33">Page 33</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28632px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:28632px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 33 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28673px; width:340px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Verify-your-vote: a verifiable blockchain-based online voting protocol.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28688px; width:381px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[18] Mccorry, P. , Shahandashti, S. F. , &amp; Hao, F. . (2017). A Smart Contract for
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28704px; width:378px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Boardroom Voting with Maximum Voter Privacy. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Financial Cryptography and
<br>Data Security. Springer</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">, Cham.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28735px; width:382px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[19] Ye. Z. Z, Pan. J, Zhao. Y. H. et.al. (2019) </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">ANNUAL REPORT ON CHIAN'S
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28750px; width:348px; height:31px;"><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">BLOCKCHAIN APPLICATION AND DEVELOPMENT</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">. Social Sciences
<br>Academic Press. No.1
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28782px; width:410px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[20] Ryan, P. Y., Bismark, D., Heather, J., Schneider, S., Xia, Z(2009).: Prêt à voter: a
<br>voter-verifiable voting system. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">IEEE Trans. Inf. Forensics Secur. 4</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(4), 662–673.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28813px; width:389px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[21] Tan. S. B. (2019) </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Ethereum Development Practice of Smart Contract. China
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28828px; width:100px; height:15px;"><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Machine Press</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">. No.4
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28844px; width:370px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[22] Lee K,James J I,Ejeta T G,et al. (2016). Electronic Voting Service Using
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28860px; width:278px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Blockchain.</span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">The Journal of Digital Forensics,Security and
<br>Law:JDFSL</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">,11(02):123.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28891px; width:409px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[23] Jason P. C, Yuichi K. (2017) E-voting System Based on the Bitcoin Protocol and
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28906px; width:317px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Blind Signatures. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Transactions on Mathematical Modeling and Its
<br></span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Applications</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">,10(01):14-22.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28938px; width:382px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[24] Xu M.X. Yuan C. Wang Y.J. et.al.(2009)Mimic blockchain--Solution to the
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28953px; width:236px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">security of blockchain. Journal of Software,30(6)
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:28969px; width:402px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[25] Si X.M. Wang W. Zeng J.J. et.al. (2017). A review of the basic theory of mimic
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:28984px; width:228px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">defense. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">Strategic Study of CAE, 18</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">(6) :62—68
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:29000px; width:377px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">[26] Selvakumar, A. L. , &amp; Ganadhas, C. S. . (2009). The Evaluation Report of
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29016px; width:336px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">SHA-256 Crypt Analysis Hash Function. </span><span style="font-family: TYEPLS+TimesNewRomanPS-ItalicMT; font-size:15px">International Conference on
<br>Communication Software &amp; Networks. IEEE.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:264px; top:29060px; width:66px; height:21px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:21px">Appendix
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:29095px; width:184px; height:18px;"><span style="font-family: ESHXQI+TimesNewRomanPS-BoldMT; font-size:18px">7.1 The Principle of ECC[8,10]
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29123px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">In order to define a specify elliptic curve field, we should define the following
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:29139px; width:72px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">six parameters:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29155px; width:95px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">T = (p, a, b, G, n, h)
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29201px; width:190px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">a, b: the parameters of elliptic equation.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:29152px; width:293px; height:200px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">p : represents prime number of finite field</span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> 
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">G: an arbitary base point in elliptic equation</span><span style="font-family: DCWGQU+CambriaMath; font-size:66px">    </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> ܿ</span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> 
<br></span><span style="font-family: DCWGQU+CambriaMath; font-size:66px">   얰  ݅᜷ ᜷ 箰耀얰  얰݅᜷ ᜷݅᜷  箰箰݅݅݅  ݂݅箰ݍ   ݅얰᜷
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">p =</span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> 얰 </span><span style="font-family: DCWGQU+CambriaMath; font-size:66px">  </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px">  </span><span style="font-family: DCWGQU+CambriaMath; font-size:66px">  </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:66px">  </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:66px">  </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:66px">  </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:66px">  </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> ᜷
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:232px; top:29255px; width:6px; height:66px;"><span style="font-family: DCWGQU+CambriaMath; font-size:66px">᜷
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29295px; width:385px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Take the SECP256K1 for example, the value of all the parameters are as follow:
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29326px; width:390px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">a = 0, b=7
<br>G=0479BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F28
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29233px; width:357px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">n: a prime number. the position of the base point G in the elliptic equation.
<br>h: a cofactor which controls the dense of the selected points.
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:28646px; width:415px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:352px; top:29220px; width:3px; height:11px;"></span>
<span style="position:absolute; border: black 1px solid; left:384px; top:29220px; width:3px; height:11px;"></span>
<span style="position:absolute; border: black 1px solid; left:112px; top:29281px; width:247px; height:0px;"></span>
<span style="position:absolute; border: gray 1px solid; left:0px; top:29482px; width:595px; height:841px;"></span>
<div style="position:absolute; top:29482px;"><a name="34">Page 34</a></div>
<div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:29524px; width:62px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Team # 1651
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:430px; top:29524px; width:58px; height:13px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:13px">Page 34 of 34
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:29564px; width:411px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">15B16F81798483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C4
<br>7D08FFB10D4B8(G=0279BE667EF9DCBBAC55A06295CE870B07029BFCDB2D
<br>CE28D959F2815B16F81798 when compressed)
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29611px; width:388px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">n=FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:29627px; width:64px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">8CD0364141
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:132px; top:29689px; width:29px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">curve.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29642px; width:392px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">h = 01
<br>The detail of encrypting process is as follow:
<br>1. Client A selects a elliptic curve E(a, b), then select a base point on the elliptic
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29705px; width:392px; height:46px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">2. Select an arbitrary point k on the curve also, where k a is integer less then n.
<br>And regard k as the private key of A. One can find a point Q which satisfies
<br>the equation: Q=k*G and take it as public key.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29752px; width:392px; height:62px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">3. Client A conveys the point E(a, b) and K, G to the client B.
<br>4. Client B receives the information such as public key from A, and then encode
<br>the plaintext to the elliptic curve as a point M, and generating a random
<br>integer r.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:29789px; width:416px; height:176px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">5. Client B computes points :</span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px">᜷</span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">= M+rK;</span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> 耀 
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">6. Client B conveys the points</span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px">᜷</span><span style="font-family: DCWGQU+CambriaMath; font-size:66px">  </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px">  </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">to A
<br>7. A computes the results</span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px">᜷</span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> 耀 </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px">  </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">once receiving the information
<br></span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px">᜷</span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> 耀 </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> ܯ 耀  耀耀   ܯ 耀  耀耀   ܯ
<br></span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">the point E(a, b), K, G, </span><span style="font-family: DCWGQU+CambriaMath; font-size:66px"> </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px">᜷</span><span style="font-family: DCWGQU+CambriaMath; font-size:66px">  </span><span style="font-family: DCWGQU+CambriaMath; font-size:47px"> </span><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">. But they are unable to derive k or r from the above
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:29939px; width:416px; height:31px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">information. Thus they have no way of learning the plain text between A and B. The
<br>process is described as Fig.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29876px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">Then, decrypting the point M again to gain the plaintext and the encrypted
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:114px; top:29908px; width:392px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">If there are sniffers intercept the message between A and B, they can only gain
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:90px; top:29892px; width:169px; height:15px;"><span style="font-family: AUWCNV+TimesNewRomanPSMT; font-size:15px">communication process is fulfilled.
<br></span></div><div style="position:absolute; border: textbox 1px solid; writing-mode:lr-tb; left:166px; top:30112px; width:263px; height:11px;"><span style="font-family: XWJAPW+DengXian-Light; font-size:11px">Fig. 28 The secrecy process of Elliptic Curve Schematic diagram
<br></span></div><span style="position:absolute; border: black 1px solid; left:90px; top:29538px; width:415px; height:0px;"></span>
<span style="position:absolute; border: black 1px solid; left:306px; top:29864px; width:3px; height:11px;"></span>
<span style="position:absolute; border: black 1px solid; left:323px; top:29864px; width:3px; height:11px;"></span>
<span style="position:absolute; border: black 1px solid; left:403px; top:29864px; width:3px; height:11px;"></span>
<span style="position:absolute; border: black 1px solid; left:422px; top:29864px; width:3px; height:11px;"></span>
<div style="position:absolute; border: figure 1px solid; writing-mode:False; left:142px; top:29975px; width:334px; height:130px;"></div><div style="position:absolute; top:0px;">Page: <a href="#1">1</a>, <a href="#2">2</a>, <a href="#3">3</a>, <a href="#4">4</a>, <a href="#5">5</a>, <a href="#6">6</a>, <a href="#7">7</a>, <a href="#8">8</a>, <a href="#9">9</a>, <a href="#10">10</a>, <a href="#11">11</a>, <a href="#12">12</a>, <a href="#13">13</a>, <a href="#14">14</a>, <a href="#15">15</a>, <a href="#16">16</a>, <a href="#17">17</a>, <a href="#18">18</a>, <a href="#19">19</a>, <a href="#20">20</a>, <a href="#21">21</a>, <a href="#22">22</a>, <a href="#23">23</a>, <a href="#24">24</a>, <a href="#25">25</a>, <a href="#26">26</a>, <a href="#27">27</a>, <a href="#28">28</a>, <a href="#29">29</a>, <a href="#30">30</a>, <a href="#31">31</a>, <a href="#32">32</a>, <a href="#33">33</a>, <a href="#34">34</a></div>
</body></html>
